Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint
نویسندگان
چکیده
We consider minimization of a quadratic objective function subject to a sign-indefinite quadratic equality constraint. We derive necessary and sufficient conditions for the existence of solutions to the constrained minimization problem. These conditions involve a generalized eigenvalue of the matrix pencil consisting of a symmetric positivesemidefinite matrix and a symmetric indefinite matrix. A complete characterization of the solution set to the constrained minimization problem in terms of the eigenspace of the matrix pencil is provided.
منابع مشابه
A New Pivot Selection Algorithm for Symmetric Indefinite Factorization Arising in Quadratic Programming with Block Constraint Matrices
Quadraticprogrammingis a class of constrained optimizationproblem with quadratic objective functions and linear constraints. It has applications in many areas and is also used to solve nonlinear optimizationproblems. This article focuses on the equality constrained quadratic programs whose constraintmatrices are block diagonal. Using the direct solution method, we propose a new pivot selection ...
متن کاملDetermining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملAnalytical aspects of the interval unilateral quadratic matrix equations and their united solution sets
This paper introduces the emph{interval unilateral quadratic matrix equation}, $IUQe$ and attempts to find various analytical results on its AE-solution sets in which $A,B$ and $CCC$ are known real interval matrices, while $X$ is an unknown matrix. These results are derived from a generalization of some results of Shary. We also give sufficient conditions for non-emptiness of some quasi-solutio...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملNew Results on Quadratic Minimization
In this paper we present several new results on minimizing an indefinite quadratic function under quadratic/linear constraints. The emphasis is placed on the case where the constraints are two quadratic inequalities. This formulation is termed the extended trust region subproblem in this paper, to distinguish it from the ordinary trust region subproblem where the constraint is a single ellipsoi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 45 شماره
صفحات -
تاریخ انتشار 2009